The Traveling Tournament Problem Description and Benchmarks
نویسندگان
چکیده
منابع مشابه
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, 2001, pp. 580–584; M. Trick, Challenge Traveling Tournament Problems, 2004] schedules a double round-robin tournament to minimize the total distan...
متن کاملA composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures. The different neighborhoods have been thoroughly analyzed and experimentally compared. We evalua...
متن کاملNew models for the Mirrored Traveling Tournament Problem
The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round-robin timetable problem. The considered objectives are to minimize the distance traveled by teams during the tournament and the new objective of minimizing the longest dista...
متن کاملA Sport Tournament Scheduling by Genetic Algorithm with Swapping Method
A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either the total number of traveling or the total distances of traveling or both. This research aims to find an optimized solution of the mirrored Traveling Tournament Problem with minimum total num...
متن کاملA 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the norepeater and mirrored co...
متن کامل